Conversion of Mersenne Twister to double-precision floating-point numbers

نویسنده

  • Shin Harase
چکیده

The 32-bit Mersenne Twister generator MT19937 is a widely used random number generator. To generate numbers with more than 32 bits in bit length, and particularly when converting into 53-bit double-precision floating-point numbers in [0, 1) in the IEEE 754 format, the typical implementation concatenates two successive 32-bit integers and divides them by a power of 2. In this case, the 32-bit MT19937 is optimized in terms of its equidistribution properties (the so-called dimension of equidistribution with v-bit accuracy) under the assumption that one will mainly be using 32-bit output values, and hence the concatenation sometimes degrades the dimension of equidistribution compared with the simple use of 32-bit outputs. In this paper, we analyze such phenomena by investigating hidden F2-linear relations among the bits of high-dimensional outputs. Accordingly, we report that MT19937 with a specific lag set fails several statistical tests, such as the overlapping collision test, matrix rank test, and Hamming independence test.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A PRNG specialized in double precision floating point numbers using an affine transition

We propose a pseudorandom number generator specialized to generate double precision floating point numbers. It generates 52-bit pseudorandom patterns supplemented by a constant most significant 12 bits (sign and exponent), so that the concatenated 64 bits represents a floating point number obeying the IEEE 754 format. To keep the constant part, we adopt an affine transition function instead of ...

متن کامل

Online Appendix to: Implementing 64-bit Maximally Equidistributed F2-Linear Generators with Mersenne Prime Period

In this appendix, we examine the 64-bit integer output sequences of the SFMT19937 generator (or the double-precision floating-point numbers in [0, 1) converted from them). In fact, the SFMT generators are optimized under the assumption that one will mainly be using 32-bit output sequences, so that the dimensions of equidistribution with v-bit accuracy for 64-bit output sequences are worse than ...

متن کامل

Implementing 64-bit Maximally Equidistributed Mersenne Twisters

In this appendix, we examine the 64-bit integer output sequences of the SFMT19937 generator (or the double-precision floating-point numbers in [0, 1) converted from them). In fact, the SFMT generators are optimized under the assumption that one will mainly be using 32-bit output sequences, so that the dimensions of equidistribution with v-bit accuracy for 64-bit output sequences are worse than ...

متن کامل

Implementation of Custom Precision Floating Point Arithmetic on FPGAs

F loating point arithmetic is a common requirement in signal processing, image processing and real time data acquisition & processing algorithms. Implementation of such algorithms on FPGA requires an efficient implementation of floating point arithmetic core as an initial process. We have presented an empirical result of the implementation of custom-precision floating point numbers on an FPGA p...

متن کامل

Dissonant Numbers

The Mersenne Twister is a 623-dimensionally equidistributed variant of the twisted generalized feedback shift register operating in 623 dimensions [6]. It is quite fast and produces a sequence of pseudo-random numbers with an enormous period and uniform distribution, which makes it suitable for use in simulations. However, the Mersenne twister is not suitable for cryptographic use: by analyzing...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1708.06018  شماره 

صفحات  -

تاریخ انتشار 2017